Application of Set-theoretic Granular Computing

نویسندگان

  • Yanli Zhu
  • Quanrui Wang
  • Shiyong Li
چکیده

Uncertain knowledge management is a key issue in the expert system. By analysis of the reasons for knowledge’s uncertainty in complete universe and uncompleted universe, two methods based on set-theoretic granular computing are presented to deal with the uncertainty knowledge which is the rough observable method and rough inclusion method respectively. The rough set can be approximately expressed as a union of some basic sets on the given universe using the concepts of rough membership function and rough observable set. Experiments on the information system show that the original indefinite sets can be described with its approximate sets, which have the certain knowledge. So the uncertainty sets have the certainty at some degree, and from which one can get more deterministic information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Art of Granular Computing

The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose a unified framework of granular computing. The new framework extends results obtained in the set-theoretic setting and extracts high-level common principles from a wide range of scientific disciplines. The art of gran...

متن کامل

Set-theoretic Approaches to Granular Computing

A framework is proposed for studying a particular class of set-theoretic approaches to granular computing. A granule is a subset of a universal set, a granular structure is a family of subsets of the universal set, and relationship between granules is given by the standard set-inclusion relation. By imposing different conditions on the family of subsets, we can define several types of granular ...

متن کامل

Granular Computing using Neighborhood Systems

A set-theoretic framework is proposed for granular computing. Each element of a universe is associated with a nonempty family of neighborhoods. A neighborhood of an element consists of those elements that are drawn towards that element by indistinguishability, similarity, proximity, or functionality. It is a granule containing the element. A neighborhood system is a family of granules, which is...

متن کامل

Theory and Application on Rough Set, Fuzzy Logic, and Granular Computing

Recently, the rough set and fuzzy set theory have generated a great deal of interest among more and more researchers. Granular computing (GrC) is an emerging computing paradigm of information processing and an approach for knowledge representation and data mining. The purpose of granular computing is to seek for an approximation scheme which can effectively solve a complex problem at a certain ...

متن کامل

INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS

Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012